The Multi-Objective Shortest Path Problem, typically posed on a graph, determines a set of paths from a start vertex to a destination vertex while optimizing multiple objectives. In general, there does not exist a single solution path that can simultaneously optimize all the objectives and the problem thus seeks to find a set of so-called Pareto-optimal solutions. To address this problem, several Multi-Objective A* (MOA*) algorithms were recently developed to quickly compute solutions with quality guarantees. However, these MOA* algorithms often suffer from high memory usage, especially when the branching factor (i.e., the number of neighbors of any vertex) of the graph is large. This work thus aims at reducing the high memory consumption of MOA* with little increase in the runtime. In this paper, we first extend the notion of "partial expansion" (PE) from single-objective to multi-objective and then fuse this new PE technique with EMOA*, a recent runtime efficient MOA* algorithm. Furthermore, the resulting algorithm PE-EMOA* can balance between runtime and memory efficiency by tuning a user-defined hyper-parameter.
translated by 谷歌翻译
深度学习推荐模型（DLRM）是广泛的，占据了相当多的数据中心足迹，并每年增长超过1.5倍。使用模型尺寸很快在Tberytes范围内，利用存储类（SCM）的推理，可以降低功耗和成本。本文评估将内存层级扩展到DLRM的主要挑战，并提出了通过软件定义内存提高性能的不同技术。我们展示了基础技术，如NAND Flash和3DXP的差异化，并涉及现实世界场景，从而可以节省5％至29％。
translated by 谷歌翻译